Modified Godard Timing Recovery for Non-Integer Oversampling Receivers

A timing recovery algorithm is introduced that operates with less than two samples per symbol and provides an enormous complexity reduction. The complexity reduction is due to a synergy with the already existing Fourier transforms in a coherent receiver, an avoidance of terms that are dominated by noise, and a complete elimination of multiplications. A simulation and an experiment with a single carrier modulation format show that the inherent timing jitter is, despite of the significant complexity reduction, comparable with the state of the art, and in particular outperforms the Godard algorithm for low roll-off factors. In addition, it is one of the few algorithms that operates with less than two samples per symbol in the frequency domain, and thus enables the lowest complexity in a receiver.